Variations on a hypercube: Embellishments of parallel architectures

Data Parallel Simulation of Self-organizing Maps on Hypercube Architectures

In this paper a data parallel model for the parallel simulation of self-organizing maps is proposed. This approach is based on the SPMD (single program multiple data) model and utilizes the highly specialized programming environment of the Vienna FORTRAN Compilation System (VFCS) for the parallelization process. It allows an easy development of the simulation system as a sequential program attr...

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

Parallel Entanglement Distribution on Hypercube Networks

Balanced Parallel Sort on Hypercube Multiprocessors

A parallel sorting algorithm for sorting n elements evenly distributed over Z d = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( ( n log n)/p + p log2 n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k = 1,. . . , ( p 1)) of the final sorted list in advance. These p 1 keys are used to partit...

Symbolic processing of Poisson series on a hypercube parallel computer

A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-32 may have a second temporal parent. We expect that reconnguration will considerably improve the performance of the intermediate-and high-level parallelism programs.